A new recursive universal code of the positive integers
نویسنده
چکیده
A new recursive universal code of the positive integers is proposed, in which any given sequence can be used as a delimiter of codeword while bit “0” is used as a delimiter in known universal codes, e.g., Levenshtein code, Elias code, Even–Rodeh code, Stout code, Bentley–Yao code, etc. The codeword length of the proposed code is shorter than log in almost all of sufficiently large positive integers although the known codes are longer than log for any positive integer .
منابع مشابه
Universality and Almost Decidability
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable. Every decidable set is almost decidable, but the conve...
متن کاملFast Modular Reduction over Euclidean Rings and Its Application to Universal Hash Functions
In this letter, we propose a fast modular reduction method over Euclidean rings, which is a generalization of Barrett’s reduction algorithm over the ring of integers. As an application, we construct new universal hash function families whose operations are modular arithmetic over a Euclidean ring, which can be any of three rings, the ring of integers, the ring of Gauss integers and the ring of ...
متن کاملStorage Operators and ∀-positive Types in TTR Type System
In 1990, J.L. Krivine introduced the notion of storage operator to simulate ”call by value” in the ”call by name” strategy. J.L. Krivine has shown that, using Gődel translation of classical into intuitionitic logic, we can find a simple type for the storage operators in AF2 type system. This paper studies the ∀-positive types (the universal second order quantifier appears positively in these ty...
متن کامل2-universal Hermitian Lattices over Imaginary Quadratic Fields
We call a positive definite integral quadratic form universal if it represents all positive integers. Then Lagrange’s Four Square Theorem means that the sum of four squares is universal. In 1930, Mordell [M] generalized this notion to a 2-universal quadratic form: a positive definite integral quadratic form that represents all binary positive definite integral quadratic forms, and showed that t...
متن کاملOn universal computably enumerable prefix codes
We study computably enumerable (c.e.) prefix codes which are capable of coding all positive integers in an optimal way up to a fixed constant: these codes will be called universal. We prove various characterisations of these codes including the following one: a c.e. prefix code is universal iff it contains the domain of a universal self-delimiting Turing machine. Finally, we study various prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000